Storage circuit control device and graphic computation device

ABSTRACT

Texture data which is two-dimensional image data indicating color data of multiple pixels positioned in a matrix form is stored in a texture buffer of a DRAM, a texture engine circuit combines the bit data making up the U address of a two-dimensional address (U, V) represented by n bits (wherein n is an integer of 1 or greater) and the bit data making up the V address of the two-dimensional address (U, V) represented by m bits (wherein m is an integer of 1 or greater), thereby generating an (n+m)-bit one-dimensional address, and the generated one-dimensional address is used to access the storage circuit. Accordingly, the storage area of the texture buffer can be used efficiently with a small circuit configuration.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a storage circuit control device and the method thereof, and a graphic computation device and the method thereof, capable of efficiently using the storage area of a storage circuit storing texture data, for example.

2. Description of the Related Art

Computer graphics are often used in various CAD (Computer Aided Design) systems, amusement devices, and so forth. Particularly, recent advancements in image processing technology has given rise to rapid propagation of systems using three-dimensional computer graphics.

With such three-dimensional computer graphics, rendering processing is performed in order to display the graphics on a display such as a CRT (Cathode Ray Tube) having pixels arrayed in matrix fashion.

In this rendering processing, the color data for each pixel is calculated, and the obtained color data is written to a display buffer (frame buffer) corresponding with the pixel. One of the techniques for rendering processing is polygon rendering. With this technique, a three-dimensional model is expressed as a combination of triangular unit shapes (polygons), and drawing is performed in units of these polygons, thereby determining the color. of the display screen.

With three-dimensional computer graphics systems using such polygon rendering, texture mapping processing is performed at the time of drawing. This texture mapping processing reads texture data indicating an image pattern from a texture buffer in units of triangles, and pasts this read texture data onto the surface of the three-dimensional model, so as to obtain highly realistic image data.

With the texture mapping processing, as shown below, a two-dimensional texture address for specifying a pixel projecting an image according to the image data is calculated, and this is used as a texture address to make reference to texture data stored in the texture buffer.

Specifically, first, the (s, t, q) of each pixel within the triangle is calculated from linear interpolation, based on the (s₁, t₁, q₁), (s₂, t₂, q₂), and (s₃, t₃, q₃) indicating the homogeneous coordinates (s, t) of the apexes of the triangle and the homogeneous item q.

Now, in simple terms, the homogeneous item q is the ratio of enlargement or reduction.

Next, division yields the (s/q, t/q) for each pixel, the s/q and t/q are each multiplied by the texture size USIZE and VSIZE, thereby generating texture coordinates data (u, v).

Next, the texture coordinates data (u, v) is converted into a texture address (U, V) on the texture buffer, and this texture address (U, V) is used to read the texture data from the texture buffer.

With three-dimensional computer graphics systems such as described above, the texture data may be stored in a two-dimensional array corresponding to a U and V coordinates system in the storage area of the texture buffer, so that direct reference can be made to the texture buffer using the texture address (U, V). That is to say, the two-dimensional texture address (U, V) may be directly used to access texture data stored in the texture buffer. This method simplifies the processing for accessing the texture data.

However, there is a problem with this method, in that storing multiple types of texture data in the texture buffer results in available area which cannot be efficiently used as shown in FIG. 10, due to the relation between the size of the texture data to be stored and the size of the available area, and consequently the storage area cannot be efficiently used.

For example, as shown in FIG. 10, in the event of storing pieces of texture data 400, 401, 402, 403, and 406, each with differing address lengths in the U and V directions, within the address space of the texture buffer so that direct reference can be made with the texture address (U, V), available areas 410 and 411 where texture data cannot be stored is created due to the relation between the two-dimensional size of the texture data to be stored and the two-dimensional size of the available area.

Consequently, a texture buffer having an extremely great storage capacity in comparison to the amount of texture data to be stored must be used, increasing the scale of the system and raising costs.

Accordingly, conventional systems calculate a one-dimensional physical address A from a two-dimensional texture address (U, V), based on “physical address A=V×(texture width)+U”, and use this physical address A to access the texture buffer, in order to use the storage area of the texture buffer in an efficient manner. Thus, texture data can be stored without creating an available area in the storage area of the texture buffer, as shown in FIG. 11.

Incidentally, “texture width” refers to the address length in the U direction, in the address space of the texture buffer.

FIG. 12 is a partial configuration diagram of a conventional three-dimensional computer graphic system.

As shown in FIG. 12, the physical address A for each pixel is calculated from the (s₁, t₁, q₁), (S₂, t₂, q₂), and (s₃, t₃, q₃) of the apex of the triangle as described above, in the address converting device 104 built into the texture mapping device 101. Then, using this calculated physical address A, the texture data (R, G, B, α) is read from the texture buffer 102 to the texture mapping device 101, this texture data (R, G, B, α) is pasted to the pixels corresponding to the surface of the three-dimensional model, thereby generating plotting data S101. This plotting data S101 is written to the display buffer 103.

Also, with high-speed three-dimensional computer graphics systems, as shown in FIG. 13 for example, an n number of texture mapping devices 10 ₁ through 101 _(n) each having built-in address converting devices 104 ₁ through 104 _(n), and texture mapping processing is simultaneously performed for an n number of pixels in a parallel manner, thereby simultaneously writing the plotting data S101 ₁ through S101 _(n) to the display buffer.

However, with three-dimensional computer graphics systems such as described above, using the physical address A generated by “physical address A=V×(texture width)+U” to generate one-dimensional physical addresses A from two-dimensional texture addresses (U, V) requires a massive multiplication circuit for performing multiplication according to the “texture width”. Consequently, this leads to a problem in which the size of the system increases.

Particularly, in cases such as shown in FIG. 13 wherein a plurality of texture mapping devices 101 ₁ through 101 _(n) are provided, the problem of circuit size is serious.

SUMMARY OF THE INVENTION

The present invention has been made in light of the problems with the above-described conventional art, and accordingly, it is an object of the present invention to provide a storage circuit control device and a graphic computation device capable of efficiently using the storage area of the texture buffer with a small circuit configuration.

It is another object of the present invention to provide a storage circuit control method and a graphic computation method capable of efficiently using the storage area of the texture buffer.

In order to solve the above-described problems with the conventional art, and to achieve the above objects, the storage circuit control device according to the present invention stores in a storage circuit two-dimensional image data indicating color data of a plurality of pixels arrayed in matrix fashion, and accesses the two-dimensional image data stored in the storage circuit using a two-dimensional address (U, V) corresponding to the two-dimensional positioning of the plurality of pixels, the storage circuit control device comprising:

an address generating means for combining the bit data making up the U address of the two-dimensional address (U, V) represented by n bits (wherein n is an integer of 1 or greater) and the bit data making up the V address of the two-dimensional address (U, V) represented by m bits (wherein m is an integer of 1 or greater), so as to generate an (n+m)-bit one-dimensional address; and

a data accessing means for accessing the storage circuit using the generated one-dimensional address.

With the storage circuit control device according to the present invention, at the time of accessing two-dimensional image data stored in the storage circuit, first, the two-dimensional address (U, V) of the pixel data to be accessed is generated, following certain image processing.

Next, at the address generating means, the bit data comprised of the n bits of U and m bits of V making up the generated two-dimensional address (U, V) are combined, so as to generate an (n+m)-bit one-dimensional address.

Next, at the data accessing means, the storage circuit is accessed using the generated one-dimensional address.

The processing in the address generating means with the storage circuit control device according to the present invention is realized with no more than a simple bit operation, and more specifically is realized by the following operations.

That is, more specifically, with the storage circuit control device according to the present invention, in the event that

the integer n and the integer m are equal;

k is an integer expressed by (n−1) <k <0;

the U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]);

and the V address is represented by the n bits of (V [n−1], . . . , V [k], . . . , V [0]);

the address generating means combines each of the bit data U [n−1], . . . , U [k], . . . , U [0] of the U address with each of the bit data V [n−1], . . . , V [k], . . . , V [0] of the V address, thereby generating 2n bits of one-dimensional addresses (V [n−1], U [n−1], . . . , V [k], U [k], . . . , V [0], U [0]).

Also, more specifically, with the storage circuit control device according to the present invention, in the event that

the integer m is (n−1);

k is an integer expressed by (n−1)<k<0;

the U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]);

and the V address is represented by the (n−1) bits of (V [n−2], . . . , V [k], . . . , V [0]);

the address generating means combines each of the bit data U [n−1], . . . , U [k], . . . , U [0] of the U address with each of the bit data V [n−2], . . . , V [k], . . . , V [0] of the V address, thereby generating (2n−1) bits of one-dimensional addresses (U [n−1], V [n−2], U [n−2], . . . , V [k], U [k], . . . , V [0], U [0]).

Also, with the graphic computation device according to a first aspect of the present invention, a three-dimensional model is represented by a combination of a plurality of unit shapes, and addresses corresponding to the homogeneous coordinates (s, t) and the homogeneous item q included in the image data for each pixel positioned within the unit shapes are used to read texture data which is image data to be pasted to the unit shapes from the storage circuit and perform the pasting thereof to the unit shapes, the graphic computation device comprising:

a storage circuit storing a plurality of pieces of texture data;

a two-dimensional address generating means for generating a two-dimensional address (U, V) comprised of a U address represented by n bits (wherein n is an integer of 1 or greater) and a V address represented by m bits (wherein m is an integer of 1 or greater), based on the results of dividing the homogeneous coordinates (s, t) by the homogeneous item q, i.e., (s/q, s/t);

a one-dimensional address generating means for generating (n+m)-bit one-dimensional addresses by combining the bit data making up the U and V in the two-dimensional addresses (U, V); and

a data reading means for using the generated one-dimensional addresses to read the texture data from the storage circuit, and perform pasting thereof to the unit shapes.

With the graphic computation device according to the first aspect of the present invention, at the two-dimensional address generating means, a two-dimensional address (U, V) comprised of the U address represented by n bits (wherein n is an integer of 1 or greater) and the V address represented by m bits (wherein m is an integer of 1 or greater), based on the results of dividing the homogeneous coordinates (s, t) by the homogeneous item q, i.e., (s/q, s/t).

Next, at the one-dimensional address generating means, (n+m)-bit one-dimensional addresses are generated by combining the bit data making up the U and V in the generated two-dimensional addresses (U, V).

Next, at the data reading means the generated one-dimensional addresses is used to read the texture data from the storage circuit, and perform pasting thereof to the unit shapes.

Also, a graphic computation device according to a second aspect of the present invention comprises:

a storage circuit for storing texture data which is image data to be pasted to unit shapes serving as basic units for expressing the form to be displayed on a display;

a polygon rendering data generating means for generating polygon rendering data regarding the apex of the unit shape, including data for three-dimensional coordinates (x, y, z), R (red), G (green), B (blue), and homogeneous coordinates (s, t) and homogeneous item q;

an interpolation data generating means for interpolating the polygon rendering data for the apex of the unit shape, and generating interpolation data for pixels positioned within the unit shape;

a two-dimensional address generating means for generating a two-dimensional address (U, V) comprised of a U address represented by n bits (wherein n is an integer of 1 or greater) and a V address represented by m bits (wherein m is an integer of 1 or greater), based on the results of dividing the homogeneous coordinates (s, t) contained in the interpolation data by the homogeneous item q, i.e., (s/q, s/t);

a one-dimensional address generating means for generating (n+m)-bit one-dimensional addresses by combining the bit data making up the U and V in the two-dimensional addresses (U, V); and

a data reading means for using the generated one-dimensional addresses to read the texture data from the storage circuit, and perform pasting thereof to the unit shapes.

Also, with the graphic computation device according to the second aspect of the present invention, first, at the polygon rendering data generating means polygon rendering data regarding the apex of the unit shape, including data for three-dimensional coordinates (x, y, z), R (red), G (green), B (blue), and homogeneous coordinates (s, t) and homogeneous item q, is generated.

Next, at the interpolation data generating means, the polygon rendering data is interpolated for the apex of the unit shape, and interpolation data is generated for pixels positioned within the unit shape.

Next, at the two-dimensional address generating means, a two-dimensional address (u, V) comprised of the U address represented by n bits (wherein n is an integer of 1 or greater) and the V address represented by m bits (wherein m is an integer of 1 or greater) is generated, based on the results of dividing the homogeneous coordinates (s, t) contained in the interpolation data by the homogeneous item q, i.e., (s/q, s/t).

Next, at the one-dimensional address generating means, (n+m)-bit one-dimensional addresses are generated by combining the bit data making up the U and V in the generated two-dimensional addresses.

Next, at the data reading means, the generated one-dimensional addresses are used to read the texture data from the storage circuit, and perform pasting thereof to the unit shapes.

Also, a graphic computation device according to a third aspect of the present invention is a graphic computation device wherein a three-dimensional model to be displayed on a display device is represented by a combination of a plurality of unit shapes, and wherein addresses corresponding to the homogeneous coordinates (s, t) and the homogeneous item q included in the image data for each pixel positioned within the unit shapes are used to read texture data which is image data to be pasted to the unit shapes from the storage circuit and perform the pasting thereof to the unit shapes, the graphic computation device comprising:

a polygon rendering data generating device for generating polygon rendering data regarding the apex of the unit shape, including data for three-dimensional coordinates (x, y, z), R (red), G (green), B (blue), and homogeneous coordinates (s, t) and homogeneous item q;

a rendering device for performing rendering processing using the polygon rendering data; and

a bus for connecting the polygon rendering data generating device and the rendering device.

Here, the rendering device comprises:

an interpolation data generating means for interpolating the polygon rendering data of the apex of the unit shape input via the bus, and generating interpolation data for pixels positioned within the unit shape;

a two-dimensional address generating means for generating a two-dimensional address (U, V) comprised of the U address represented by n bits (wherein n is an integer of 1 or greater) and the V address represented by m bits (wherein m is an integer of 1 or greater), based on the results of dividing the homogeneous coordinates (s, t) contained in the interpolation data by the homogeneous item q, i.e., (s/q, s/t);

a one-dimensional address generating means for generating (n+m)-bit one-dimensional addresses by combining the bit data making up the U and V in the two-dimensional addresses; and

a data reading means for using the generated one-dimensional addresses to read the texture data from the storage circuit, and perform pasting thereof to the unit shapes.

With the graphic computation device according to the third aspect of the present invention, first, at the polygon rendering data generating means, polygon rendering data regarding the apex of the unit shape, including data for three-dimensional coordinates (x, y, z), R (red), G (green), B (blue), and homogeneous coordinates (s, t) and homogeneous item q, is generated. This polygon rendering data is transferred to the rendering device via the bus.

Next, the following processing is carried out at the rendering device.

That is, at the interpolation data generating means the polygon rendering data of the apex of the unit shape input via the bus is interpolated, and interpolation data for pixels positioned within the unit shape is generated.

Next, at the two-dimensional address generating means, a two-dimensional address (U, V) comprised of a U address represented by n bits (wherein n is an integer of 1 or greater) and a V address represented by m bits (wherein m is an integer of 1 or greater) is generated, based on the results of dividing the homogeneous coordinates (s, t) contained in the interpolation data by the homogeneous item q, i.e., (s/q, s/t).

Next, at the one-dimensional address generating means, (n+m)-bit one-dimensional addresses are generated by combining the bit data making up the U and V in the generated two-dimensional addresses.

Next, at the data reading means, the generated one-dimensional addresses is used to read the texture data from the storage circuit, and perform pasting thereof to the unit shapes.

Also, the storage circuit control method according to the present invention is a storage circuit control method which stores in a storage circuit two-dimensional image data indicating color data of a plurality of pixels arrayed in matrix fashion, and accesses the two-dimensional image data stored in the storage circuit using a two-dimensional address (U, V) corresponding to the two-dimensional positioning of the plurality of pixels, comprising the steps of:

combining the bit data making up the U address of the two-dimensional address (U, V) represented by n bits (wherein n is an integer of 1 or greater) and the bit data making up the V address of the two-dimensional address (U, V) represented by m bits (wherein m is an integer of 1 or greater) and

accessing the storage circuit using the generated one-dimensional address.

Further, the graphic computation method according to the present invention is a graphic computation method wherein a three-dimensional model is represented by a combination of a plurality of unit shapes, and wherein addresses corresponding to the homogeneous coordinates (s, t) and the homogeneous item q included in the image data for each pixel positioned within the unit shapes are used to read texture data which is image data to be pasted to the unit shapes from the storage circuit and perform the pasting thereof to the unit shapes, comprising the steps of:

storing a plurality of pieces of texture data in a storage circuit;

generating a two-dimensional address (U, V) comprised of the U address represented by n bits (wherein n is an integer of 1 or greater) and the V address represented by m bits (wherein m is an integer of 1 or greater), based on the results of dividing the homogeneous coordinates (s, t) by the homogeneous item q, i.e., (s/q, s/t);

generating (n+m)-bit one-dimensional addresses by combining the bit data making up the U and V in the two-dimensional addresses; and

using the generated one-dimensional addresses to read the texture data from the storage circuit, and perform pasting thereof to the unit shapes.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a system configuration diagram of a three-dimensional computer graphics system according to an embodiment of the present invention;

FIG. 2 is an internal configuration diagram of the texture engine circuit shown in FIG. 1;

FIG. 3 is a diagram for describing texture data of multiple reduction ratios, stored in the texture buffer shown in FIG. 1 and subjected to MIPMAP filtering;

FIG. 4 is a configuration diagram of the texture data reading circuit;

FIG. 5 is a flowchart of the processing in the texture data reading circuit shown in FIG. 2;

FIG. 6 is a diagram describing a method for generating a one-dimensional physical address A from a two-dimensional texture address (U_(i), V_(i)) in the texture engine circuit;

FIG. 7 is a configuration diagram of the DRAM and SRAM shown in FIG. 1 and blocks having access functions to the DRAM and SRAM of the memory interface circuit;

FIG. 8 is a diagram describing a method for generating a one-dimensional physical address A in the event that the two-dimensional texture address (U, V) consists of 4 bits for both U and V;

FIG. 9 is a diagram describing a method for generating a one-dimensional physical address A in the event that the two-dimensional texture address (u, V) consists of 3 bits for U and 2 bits for V;

FIG. 10 is a diagram for describing the problems involved in directly using a two-dimensional texture address (U, V) to store multiple types of texture data in a texture buffer;

FIG. 11 is a diagram for describing the storage state when using a one-dimensional physical address to store multiple types of texture data in a texture buffer;

FIG. 12 is a partial configuration diagram of a conventional three-dimensional computer graphics system; and

FIG. 13 is a partial configuration diagram of a conventional three-dimensional computer graphics system, capable of high-speed processing.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The following is a description of an embodiment of a three-dimensional computer graphics system which performs high-speed display onto a display device such as a CRT, of desired three-dimensional images corresponding to an arbitrary three-dimensional object model, such as is applied to home video games and the like.

FIG. 1 is a system configuration diagram of a three-dimensional computer graphics system 1 according to the present embodiment.

The three-dimensional computer graphics system 1 is a system performs polygon rendering processing, which represents three-dimensional models as a combination of unit shapes which are triangles (polygons), and plots these polygons to determine the color for each pixel in the display screen which is then displayed on the display.

Also, with the three-dimensional computer graphics system 1, in addition to the (x, y) coordinates representing the position on the plane, a z-coordinate is used to represent depth, thereby representing a three-dimensional model, and an arbitrary point in the three-dimensional space is specified by these three coordinates, (x, y, z).

As shown in FIG. 1, with the three-dimensional computer graphics system 1, a main memory 2, I/O interface circuit 3, main processor 4, and rendering circuit 5 are connected via a main bus 6.

The following is a description of the functions of each component.

The main processor 4 reads necessary graphic data from the main memory 2 according to the state of progression of the game or the like, performs clipping, lighting, geometry, or likewise processing regarding this graphic data, thereby generating polygon rendering data. The main processor 4 outputs the polygon rendering data S4 to the rendering circuit 5 via the main bus 6.

The I/O interface circuit 3 externally inputs polygon rendering data as necessary, and outputs this to the rendering circuit 5 via the main bus 6.

Now, the polygon rendering data contains the (x, y, z, R, G, B, α, s, t, q, F) data for the each of the three apexes of the polygon.

Here, the (x, y, z) data indicates the three-dimensional coordinates of the polygon apexes, and the (R, G, B) data indicates the brightness values of red, green, and blue at each of the three-dimensional coordinates.

The data α represents a blending coefficient for blending of the R, G, and B data of the pixels to be plotted with the pixels already stored in the display buffer 21.

Of the (s, t, q) data, the (s, t) indicates the homogeneous coordinates of the corresponding texture, and q indicates a homogeneous item. Now, “s/q” and “t/q” are multiplied by respective texture sizes USIZE and VSIZE so as to obtain texture coordinates data (u, v). Access to the texture data stored in the texture buffer 20 is performed using the texture coordinates data (u, v).

The F data indicates the a value of fogging.

In other words, the polygon rendering data indicates the physical coordinates value of the apexes of the triangle, the color and texture of each apex, and fog value data.

Next, the rendering circuit 5 will be described in detail.

As shown in FIG. 1, the rendering circuit 5 has a DDA (Digital Differential Analyzer) setup circuit 10, triangle DDA circuit 11 serving as an interpolation data generating means, texture engine circuit 12, memory interface circuit 13, CRT controller circuit 14, RAMDAC circuit 15, DRAM 16, and SRAM 17.

The DRAM 16 functions as the texture buffer 20 serving as a storage circuit, display buffer 21, z buffer 22 and texture CLUT buffer 23.

DDA Setup Circuit 10

The DDA setup circuit 10 performs setup computations for obtaining such as the differential of the sides and horizontal direction of the triangle, regarding data (z, R, G, B, α, s, t, q, F) indicated by the polygon rendering data S4, before the latter tier triangle DDA circuit 11 performs linear interpolation for each apex of the triangle on the physical coordinates and calculates the color and depth information for each pixel within the triangle.

Specifically, this setup computation calculates the variations of the value to be obtained in the event that there is movement of a unit length, using the starting point value and ending point value, and the distance between the starting point and ending point.

The DDA setup circuit 10 outputs the calculated variations data S10 to the triangle DDA circuit 11.

Triangle DDA Circuit 11

The triangle DDA circuit 11 uses the variations data S10 input from the DDA setup circuit 10 to calculate the linear-interpolated (z, R, G, B, α, s, t, q, F) data for each pixel within the triangle.

The triangle DDA circuit 11 outputs the (x, y) data for each pixel, and the (z, R, G, B, α, s, t, q, F) data for the (x, y) coordinates, to the texture engine circuit 12 as DDA data S11.

With the present embodiment, the triangle DDA circuit 11 performs output of the DDA data S11 to the texture engine circuit 12 in units of 8 (=2×4) pixels positioned within a rectangle, to be processed in a parallel manner.

Texture Engine Circuit 12

The texture engine circuit 12 sequentially performs selection processing of the reduction ratio of the texture data, calculation processing of “s/q” and “t/q”, calculation processing of texture coordinates data (u, v), calculation processing of two-dimensional texture addresses (U, V), generation of the one-dimensional physical address A, reading (R, G, B, tα) data from the texture buffer 20, and mixing processing (texture α blending processing), by the pipeline method.

At this time, the texture exchange circuit 12 simultaneously performs parallel processing for 8 pixels positioned within a certain rectangular area.

FIG. 2 is a configuration diagram of the texture exchange circuit 12.

As shown in FIG. 2, the texture exchange circuit 12 has a reduction ratio computing circuit 304, texture data readout circuit 305, and a texture α blend circuit 306.

The reduction ratio computing circuit 304 calculates the reduction ratio 1od of the texture data, using the 8 pixels worth of (s, t, q) data S11 a ₁ through S11 a ₈ and the like included in the DDA data S11.

Now, the reduction ratio indicates to what extent the texture data of the original image has been reduced, and in the event that the reduction ratio of the original image is 1/1, the reduction ratio is 1/2, 1/4, 1/8, and so forth.

Stored in the texture buffer 20 are texture data 320, 321, 322, 323, with lod=0, 1, 2, 3, 4, for example, as shown in FIG. 3.

Now, the address space within the storage area of the texture buffer 20 is represented by a U-V coordinates system as shown in FIG. 3, with a reference address (start address) in the storage area where texture data corresponding to multiple reduction ratios is stored, is calculated based on the reduction ratio lod. In the example shown in FIG. 7, the reference addresses for texture data 320, 321, 322, and 323 are (ubase₀, vbase₀), (ubase₁, vbase₁), (ubase₂, vbase₂), and (ubase₃, vbase₃).

Also, the texture address (U, V) for each of the pixels in the texture data stored in the texture buffer 20 is an address obtained by adding the reference address (ubase, vbase) and the texture coordinates data (u, v). (Texture data readout circuit 305)

The texture data readout circuit 305 inputs the 8 pixels worth of (s, t, q) data S11 a ₁ through S11 a ₈ included in the DDA data S11, the reduction rate lod from the reduction ratio computing circuit 304, and texture size USIZE and VSIZE, reads texture data S17 ₁ through S17 ₈ corresponding to each of the 8 pixels from the texture buffer 20, and outputs this to the texture α blend circuit 306.

FIG. 4 is a configuration diagram of the texture data readout circuit 305. FIG. 5 is a flowchart of the processes performed in the texture data readout circuit 305.

As shown in FIG. 4, the texture data readout circuit 305 has a (u, v) calculating circuit 501, (U, V) calculating circuit 502, physical address generating circuit 503 serving as an address generating means, and an access control circuit 504 serving as a data accessing means.

In step S21, the texture data readout circuit 305 first performs computation at the (u, v) calculating circuit 501 to divide the s data by the q data and to divide the t data by the q data for each of the 8 pixels worth of (s, t, q) data S11 a ₁ through S11 a ₈, so as to calculate the division results “s/q” and “t/q”.

Then, the division results “s/q” and “t/q” are each multiplied by the texture size USIZE and VSIZE, thereby calculating texture coordinates data (u₁, v₁) through (U₈, V₈) corresponding to each pixel.

In step S22, the (U, V) calculating circuit 502 makes reference to an address table prepared beforehand for example, and obtains a reference address (ubase, vbase) corresponding to the reduction ratio lod.

Then, the (U, V) calculating circuit 502 adds the reference address (ubase, vbase) and the texture coordinates data (u₁, v₁) through (u₈, v₈) input from the (u, v) calculating circuit 501, thereby generating texture addresses (U₁, V₁) through (U₈, V₈) wherein the storage area of the texture buffer 20 is represented by a U-V two-dimensional coordinates system.

According to the present embodiment, in the event that “i” is an integer wherein 1≦i≦8, the u_(i) and v_(i) in the texture addresses (U_(i), V_(i)) each are comprised of the 3 bits shown in the following Expressions (1) and (2)

Expression (1)

U _(i)=(U _(i)[2], U _(i)[1], U _(i)[0])  (1)

Expression (2)

V _(i)=(V _(i)[2], V _(i)[1], V _(i)[0])  (2)

In step S23, the physical address generating circuit 503 joins the bits making up U_(i) and V_(i) regarding each of the texture addresses (U₁, V₁) through (U₈, V₈) input from the (U, V) calculating circuit 502 according to the pattern shown in the following Expression (3), thereby generating a physical address A. The generation of this physical address A is realized with no more than a simple bit replacing operation, so high speeds can be carried out with a small circuit configuration.

Expression (3)

Physical address A=(V _(i)[2], U _(i)[2], V _(i)[1], U _(i)[1], V _(i)[0], U _(i)[0])  (3)

The generation of the physical address A shown in the above Expression (3) is shown in FIG. 6. In FIG. 6, the vertical axis V represents the value of V_(i) shown by 3 bits, the horizontal axis U represents the value of U_(i) shown by 3 bits, and “0” through “63”, arrayed in matrix fashion represent the value of the physical address A.

That is to say, the two-dimensional texture address (U_(i), V_(i)) positioned in a matrix fashion represented by 3-bit U_(i) and V_(i), is converted into continuous one-dimensional physical addresses A of “0” through “63”, by the above Expression (3).

It should be noted though, that with the present invention, U_(i) is 2^(n) bits (wherein n is an integer of 1 or greater), V_(i) is 2^(m) bits (wherein m is an integer of 1 or greater), and further wherein n−m or m−n−1 holds.

A specific example of conversion with the above Expression (3) will now be given with reference to FIG. 6.

For example, in the event that U_(i)=(0, 1, 0) and V_(i)=(1, 0, 0), the physical address A=(1, 0, 0, 1, 0, 0) according to the above Expression (3), which is “36” in a decimal expression. Here, U_(i)=(0, 1, 0)=2, and V_(i)=(1, 0, 0)=4. In FIG. 6, the position A of U=2, V=4 is “36”.

Also, in the event that U_(i)=(0, 0, 1) and V_(i)=(0, 1, 0), the physical address A=(0, 0, 1, 0, 0, 1) according to the above Expression (3), which is “9” in a decimal expression. Here, U_(i)=(0, 0, 1)=1, and V_(i)=(0, 1, 0)=2. In FIG. 6, the position B of U=1, V=2 is “9”.

In step S24, the access control circuit 504 outputs the one-dimensional physical address A input from the physical address generating circuit 503 to the texture buffer 20 via the memory interface circuit 13 shown in FIG. 1, and reads out the (R, G, B, tα) data S17 ₁ through S17 ₈ which is texture data.

Incidentally, a copy of the texture data stored in the texture buffer 20 is stored in the SRAM 17, so the texture engine circuit 12 actually reads out the texture data stored in the SRAM 17, via the memory interface circuit 13.

In step S25, the access control circuit 504 outputs the (R, G, B, tα) data S17 ₁ through S17 ₈ read out in step S24 to the texture α blend circuit 306.

(Texture α blend circuit 306)

The texture α blend circuit 306 inputs the 8 pixels worth of (R, G, B) data S11 b ₁ through S11 b ₈ included in the DDA data S11, and the (R, G, B, tα) data S17 ₁ through S17 ₈ read by the texture data readout circuit 305, and mixes the (R, G, B) data contained in each of the (R, G, B) data S11 b ₁ through S11 b ₈ and the data S17 ₁ through S17 ₈ according to the mixture value indicated by the tα contained in the data S17 ₁ through S17 ₈, thereby generating (R, G, B) data S306 ₁ through S306 ₈.

Then, the α data S11 d ₁ through S11 d ₈ contained in the DDA data, and the (R, G, B) data S306 ₁ through S306 ₈ are output to the memory interface circuit 13 as (R, G, B, α) data S12 a ₁ through S12 a ₈.

Incidentally, in the case of the full-color method, the texture engine circuit 12 directly uses the (R, G, B, tα) data directly read out from the texture buffer 20. On the other hand, in the case of the index color method, the texture engine circuit 12 reads a color look-up table (CLUT) prepared beforehand from the texture CLUT buffer 23, transfers and stores this to build-in SRAM, and uses this color look-up table to obtain (R, G, B) data corresponding to the color index read from the texture buffer 20.

DRAM 16 and SRAM 17

FIG. 7 is a configuration diagram of DRAM 16, SRAM 17, and blocks having access functions to the DRAM 16 and SRAM 17 of the memory interface circuit 13.

As shown in FIG. 7, the DRAM 16 and SRAM 17 shown in FIG. 1 have memory modules 200, 201, 202, and 203.

The memory module 200 has memory 210 and 211.

The memory 210 has banks 210, and 2102, comprising a part of the DRAM 16, and banks 220 ₁ and 220 ₂, comprising a part of the SRAM 17.

Also, the memory 211 has banks 211 ₁ and 211 ₂, comprising a part of the DRAM 16, and banks 221 ₁ and 221 ₂, comprising a part of the SRAM 17.

The banks 220 ₁, 220 ₂, 221 ₁, and 221 ₂ can be accessed simultaneously.

Now, each of the memory modules 201, 202, and 203 basically have the same configuration as the memory module 200.

Now, each of the memory modules 200, 201, 202, and 203 have all of the functions of the texture buffer 20, display buffer 21, Z buffer 22, and texture CLUT buffer 23 shown in FIG. 1.

That is to say, each of the memory modules 200, 201, 202, and 203 store all of the texture data of corresponding pixels, plotting data ((R, G, B) data), z data, and texture color look-up table data.

However, it should be noted that the memory modules 200, 201, 202, and 203 store data regarding mutually different pixels.

Now, the texture data regarding 16 pixels to be simultaneously processed, the plotting data, z data, and texture color look-up table data, are stored in mutually different banks 210 ₁, 210 ₂, 211 ₁, 211 ₂, 212 ₁, 212 ₂, 213 ₁, 213 ₂, 214 ₁, 214 ₂, 215 ₁, 215 ₂, 216 ₁, 216 ₂, 217 ₁, and 217 ₂.

Thus, the data regarding the 16 pixels can be simultaneously accessed as to the DRAM 16.

Incidentally, the banks 220 ₁, 220 ₂, 221 ₁, 221 ₂, 222 ₁, 222 ₂, 223 ₁, 223 ₂, 224 ₁, 224 ₂, 225 ₁, 225 ₂, 226 ₁, 226 ₂, 227 ₁, and 227 ₂ each store copies of the texture data stored in the banks 210 ₁, 210 ₂, 211 ₁, 211 ₂, 212 ₁, 212 ₂, 213 ₁, 213 ₂, 214 ₁, 214 ₂, 215 ₁, 215 ₂, 216 ₁, 216 ₂, 217 ₁, and 217 ₂.

Memory Interface Circuit 13

Also, the memory interface circuit 13 compares the (R, G, B, α) data S12 a ₁ through S12 a ₈ input from the texture engine circuit 12, i.e., z data corresponding to the pixel data S12 a, with the z data stored in the z buffer 22, and judges whether the image to be drawn by the input pixel data S12 a is closer to the viewpoint side than the image previously written to the display buffer 21 or not. In the event that the image to be drawn is closer, the z data stored in the z buffer 22 is updated with the z data corresponding to the pixel data S12 a.

Also, when necessary, the memory interface circuit 13 performs blending of the (R, G, B) data contained in the pixel data S12 a with the (R, G, B) data already stored in the display buffer 21 according to a blending value indicated by α data corresponding to the pixel data S12 a, i.e., performs α blending, and writes the post-blending (R, G, B) data to the display buffer 21.

The memory interface circuit 13 accesses the DRAM 16 simultaneously regarding 16 pixels.

As shown in FIG. 7, the memory interface circuit 13 has memory controllers 240, 241, 242, and 243, address converters 250, 251, 252, 253, a distributor 260, and a readout controller 262.

The distributor 260 inputs 16 pixels worth of (R, G, B) data at the time of writing for example, divides these into 4 pieces of image data S260 ₀, S260 ₁, S260 ₂, and S260 ₃, each consisting of 4 pixels worth of data, which are each output to the address converters 250, 251, 252, 253.

Here, the 1 pixel worth of (R, G, B) data and the z data are 32 bits each.

The address converters 250, 251, 252, 253 convert the (R, G, B) data input from the distributor 260 at the time of writing and the addresses corresponding to the z data, into addresses within the respective memory modules 200, 201, 202, and 203, and outputs the converted addresses S250, S251, S252, and S253 to the memory controller 240.

The memory controllers 240, 241, 242, and 243 are respectively connected to the memory modules 200, 201, 202, and 203 via wiring groups 270, 271, 272, and 273, and control access to the memory modules 200, 201, 202, and 203 at the time of writing.

Specifically, the memory controllers 240, 241, 242, and 243 simultaneously write the 4 pixels worth of (R, G, B) data and z data input from the distributor 260 to the memory modules 200, 201, 202, and 203 via the wiring groups 270, 271, 272, and 273.

At this time, at the memory module 200 for example, one pixel worth of (R, G, B) data and z data is stored to each of the banks 210 ₁, 210 ₂, 210 ₃, and 210 ₄. This is also true for the memory modules 201, 202, and 203.

Incidentally, with the present embodiment, each of the wiring groups 270, 271, 272, and 273 are 256 bits.

The readout controller 262 is connected to the memory modules 200, 201, 202, and 203 via the wiring group 280, and at the time of reading, reads out texture data, (R, G, B) data, z data, and texture color look-up table data from the memory modules 200, 201, 202, and 203 via the wiring group 280 in units of 8 pixels or 16 pixels.

Incidentally, with the present embodiment, the wiring group 280 is 1024 bits.

CRT Controller Circuit 14

The CRT controller circuit 14 generates addresses for display on an unshown CRT in a manner synchronous with supplied horizontal and vertical synchronizing signals, and outputs requests to read display data from the display buffer 21 to the memory interface circuit 13. In response to this request, the memory interface circuit 13 reads display data from the display buffer 21 in certain blocks. The CRT controller circuit 14 has a built-in FIFO (First In First Out) circuit for storing display data read from the display buffer 21, and outputs RGB index values to the RAMDAC circuit 15 at certain time intervals.

RAMDAC Circuit 15

The RAMDAC circuit 15 stores (R, G, B) data corresponding to each index value, and transfers digital format (R, G, B) data corresponding to the RGB index values input from the CRT controller circuit 14 to a D/A converter, thereby generating analog format (R, G, B) data. The RAMDAC circuit 15 outputs this generated R, G, B data to the CRT.

The following is a description of the operation of the three-dimensional computer graphics system 1.

With the three-dimensional computer graphics system 1 shown in FIG. 1, the polygon rendering data S4 is output from the main processor 4 to the DDA setup circuit 10 via the main bus 6, and variations data S10 indicating the difference in the sides and horizontal direction of the triangle is generated in the DDA setup circuit 10.

Then, the variations data S10 is output from the DDA setup circuit 10 to the triangle DDA circuit 11.

Next, in the triangle DDA circuit 11, linear-interpolated (z, R, G, B, α, s, t, q, F) data for each pixel within the triangle is generated based on the variations data S10.

Then, the (x, y) data for each pixel, and the (z, R, G, B, α, s, t, q, F) data for the (x, y) coordinates, are output from the triangle DDA circuit 11 to the texture engine circuit 12 as DDA data S11.

Next, at the reduction ratio computing circuit 304 in the texture engine circuit 12 shown in FIG. 2, the reduction ratio of the texture data is calculated using the 8 pixels worth of (s, t, q) data S11 a ₁ through S11 a ₈ contained in the DDA data S11, and this reduction ratio lod is output to the texture data readout circuit 305.

Next, in the texture data readout circuit 305, according to the flow shown in FIG. 5, texture data S171 through S17 ₈ is read out from the texture buffer 20 (SRAM 17) using the one-dimensional physical address A generated based on the aforementioned Expression (3), and the texture data S17 ₁ through S17 ₈ that has been read out is output to the texture α blend circuit 306.

At this time, 16 pixels worth of texture data containing texture data S17 ₁ through S17 ₈ are read out from the banks 220 ₁, 220 ₂, 221 ₁, 221 ₂, 222 ₁, 222 ₂, 223 ₁, 223 ₂, 224 ₁, 224 ₂, 225 ₁, 225 ₂, 226 ₁, 226 ₂, 227 ₁, and 227 ₂ making up the SRAM 17, via the wiring group 280, by control of the readout controller 262 shown in FIG. 7.

Next, at the texture α blend circuit 306, the (R, G, B) data S11 b ₁ through S11 b ₈ and the (R, G, B) data contained in the data S17 ₁ through S17 ₈ are blended according a blending value indicated by the tα included in the data S17 ₁ through S17 ₈, thereby generating (R, G, B) data S306 ₁ through S306 ₈.

Then, the α data S11 d ₁ through S11 d ₈ contained in the DDA data and the (R, G, B) data S306 ₁ through S306 ₈ are output to the memory interface circuit 13 as (R, G, B, α) data S12 a, through S12 a ₈, i.e., as pixel data S12 a.

Then, in the memory interface circuit 13, the z data corresponding to the pixel data S12 a input from the texture engine circuit 12 and the z data stored in the z buffer 22 are compared, and judgement is made whether the image to be drawn by the input pixel data S12 a is closer to the viewpoint side than the image previously written to the display buffer 21 or not. In the event that the image to be drawn is closer, the z data stored in the z buffer 22 is updated with the z data corresponding to the image data S12 a.

Next, in the memory interface circuit 13, when necessary, the (R, G, B) data contained in the image data S12 a is blended with the (R, G, B) data already stored in the display buffer 21 according to a blending value indicated by α data corresponding to the pixel data S12 a, and the post-blending (R, G, B) data is written to the display buffer 21.

At this time, 16 pixels worth of (R, G, B) data is written to the banks 210 ₁, 210 ₂, 211 ₁, 211 ₂, 212 ₁, 212 ₂, 213 ₁, 213 ₂, 214 ₁, 214 ₂, 215 ₁, 215 ₂, 216 ₁, 216 ₂, 217 ₁, and 217 ₂ making up the display buffer 21 shown in FIG. 1, via the wiring groups 270, 271, 272, and 273 by control of the memory controllers 240, 241, 242, and 243, shown in FIG. 7.

As described above, according to the three-dimensional computer graphics system 1, the bits making up U and V two-dimensional texture addresses (U, V) indicating two-dimensional address space of the texture buffer 20 are joined according to the pattern shown in the above Expression (3), thereby generating the one-dimensional physical address A. The generation of this physical address A is realized with no more than a simple bit operation, so generation of the physical address A at high speeds can be realized with a small circuit configuration.

Also, texture data can be stored in continuous storage area in the texture buffer 20 using the one-dimensional physical address, so available area such as shown in FIG. 10 is not generated, and the storage area of the texture buffer 20 can be efficiently used. Consequently, the storage capacity of the texture buffer 20 can be reduced, leading to reduction in the size of the device and reduction in costs.

It should be noted that the present invention is by no means restricted to the above embodiments.

For example, the above embodiment describes and example with both U_(i) and V_(i) being 3 bits, but the present invention is applicable to cases wherein both U_(i) and V_(i) are n=2, or n (n≧4) bits.

For example, in the event that both U_(i) and V_(i) are 4 bits as shown in the following Expressions (4) and (5), the one-dimensional address A is generated as shown in FIG. 8, by the Expression (5).

Expression (4)

U _(i)=(U _(i)[3], U _(i)[2], U _(i)[1], U _(i)[0])  (4)

Expression (5)

V _(i)=(V _(i)[3], V _(i)[2], V _(i)[1], V _(i)[0])  (5)

Expression (6)

Physical address A=(V _(i)[3], U _(i)[3], V _(i)[2], U _(i)[2], V _(i)[1], U _(i)[1], V _(i)[0], U _(i)[0])  (6)

Also, the number of bits of U_(i) and V_(i) do not need to match. Specifically, an arrangement may be used wherein in the event that U_(i) is n bits, V_(i) is n−1 bits.

For example, in the event that U_(i) and V_(i) are 3 bits and 2 bits respectively, as shown in the following Expressions (7) and (8), the one-dimensional address A is generated as shown in FIG. 9, by the Expression (9).

Expression (7)

U _(i)=(U _(i)[2], U _(i)[1], U _(i)[0])  (7)

Expression (8)

V _(i)=(V _(i)[1], V _(i)[0])  (8)

Expression (9)

Physical address A=(U _(i)[3], V _(i)[2], U _(i)[2], V _(i)[1], U _(i)[1], V _(i)[0], U _(i)[0])  (9)

Also, the number of pixels to be simultaneously processed has been described as 8 in the above embodiments, but this number is arbitrary, and may be 4, for example. However, it is preferable that the number of pixels to be simultaneously processed be an exponentiation of the number 2.

Also, though an example has been given of the three-dimensional computer graphics system 1 shown in FIG. 1 having a configuration using SRAM 17, but a configuration not provided with SRAM 17 may be used instead.

Also, the texture buffer 20 and texture CLUT buffer 23 shown in FIG. 1 may be provided externally from the DRAM 16.

Further, though an example has been given wherein the three-dimensional computer graphics system 1 shown in FIG. 1 performs geometry processing for generating polygon rendering data with a main processor 4, a configuration may be used wherein this is performed is the rendering circuit 5.

As described above, with the storage circuit control device according to the present invention, two-dimensional image data can be efficiently stored in a storage circuit with a small circuit configuration. Consequently, the storage area of the storage circuit can be efficiently used.

Also, with the graphic computation device according to the present invention, texture data can be efficiently stored in a storage circuit with a small circuit configuration. Consequently, the storage area of the storage circuit can be efficiently used.

Also, with the storage circuit control method according to the present invention, two-dimensional image data can be efficiently stored in a storage circuit, so the storage area of the storage circuit can be efficiently used.

Also, with the graphic computation method according to the present invention, texture data can be efficiently stored in a storage circuit, so the storage area of the storage circuit can be efficiently used.

Also, with the storage circuit control device and the method thereof, and the graphic computation device and the method thereof, according to the present invention, address conversion at the time of accessing the storage circuit can be carried out at high speed. 

What is claimed is:
 1. A storage circuit control device for accessing two dimensional image data indicating color data of a plurality of pixels arrayed in matrix fashion from a storage circuit using a two-dimensional address (U, V) corresponding to the two-dimensional positioning of said plurality of pixels, the U address represented by n bits of data having a bit value (wherein n is an integer of 1 or greater) and the V address represented by m bits of data having a bit value (wherein m is an integer of 1 or greater), each of the U address and V address having a decimal value corresponding to its bit value, said storage circuit control device comprising: an address generating means for combining the n bits of data making up a U address and the m bits of data making up a V address to generate an (n+m)-bit one-dimensional address having a corresponding decimal value; and data accessing means for accessing said storage circuit using said generated one-dimensional address; wherein the image data is stored in the storage circuit in a plurality of blocks forming a U, V matrix, where one axis of the matrix represents the decimal value of the n bits of data making up is the U address, the other axis of the matrix represents the decimal value of the m bits of data making up the V address and each of the blocks correspond to the decimal value of one of a plurality of (n+m)-bit one-dimensional addresses.
 2. The device of claim 1, wherein in the event that said integer n and said integer m are equal; and wherein k is an integer expressed by (n−1)<k<0; and wherein said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]); and wherein said V address is represented by the n bits of (V [n−1], . . . , V [k], . . . , V [0]); said address generating means combines each of the bit data U [n−1], . . . , U ([k], . . . , U [0] of said U address with each of the bit data V [n−1], . . . , V [k], . . . , V [0] of said V address, thereby generating 2n bits of one-dimensional addresses (V [n−1], U [n−1], . . . , V [k], U [k], . . . , V [0], U [0]).
 3. The device of claim 1, wherein in the event that said integer m is (n−1); and wherein k is an integer expressed by (n−1)<k<0; and wherein said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]); and wherein said V address is represented by the (n−1) bits of (V [n−2], . . . , V [k], . . . , V [0]); said address generating means combines each of the bit data U [n−1], . . . , U [k], . . . , U [0] of said U address with each of the bit data V [n−2], . . . , V [k], . . . , V [0] of said V address, thereby generating (2n−1) bits of one-dimensional addresses (U [n−1], V [n−2], U [n−2], . . . , V [k], U [k], . . . , V [0], U [0]).
 4. A graphic computation device for pasting texture data to a three-dimensional model represented by a combination of a plurality of unit shapes, each unit shape including a plurality of pixels, each pixel having associated rendering data including a set of homogeneous coordinates (s, t) and a homogeneous item q, said graphic computation device comprising: a storage circuit storing a plurality of pieces of texture data; a two-dimensional address generating means for generating two-dimensional addresses (U, V) comprised of a U address represented by n bits of data (wherein n is an integer of 1 or greater) and a V address represented by m bits of data (wherein m is an integer of 1 or greater), based on results of dividing said homogeneous coordinates (s, t) by said homogeneous item q; a one-dimensional address generating means for generating (n+m)-bit one-dimensional addresses by combining the n bits of data making up the U address and the m bits of data making up the V address in said two-dimensional addresses (U, V); and a data reading means For using said generated one-dimensional addresses to read texture data from said storage circuit, and perform pasting thereof to said unit shapes.
 5. The device of claim 4, wherein in the event that said integer n and said integer m are equal; and wherein k is an integer expressed by (n−1)<k<0; and wherein said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]); and wherein said V address is represented by the n bits of (V [n−1], . . . , V [k], . . . , V [0]); said address generating means combines each of the bit data U [n−1], . . . , U [k], . . . , U [0] of said U address with each of the bit data V [n−1], . . . , V [k], . . . , V [0] of said V address, thereby generating 2n bits of one-dimensional addresses (V [n−1], U [n−1], . . . , V [k], U [k], . . . , V [0], U [0]).
 6. The device of claim 4, wherein in the event that said integer m is (n−1); and wherein k is an integer expressed by (n−1)<k<0; and wherein said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]); and wherein said V address is represented by the (n−1) bits of (V [n−2)], . . . , V [k], . . . , V [0]); said address generating means combines each of the bit data U [n−1], . . . , U [k], . . . , U [0] of to said U address with each of the bit data V [n−2], . . . , V [k], . . . , V [0] of said V address, thereby generating (2n−1) bits of one-dimensional addresses (U [n−1], V [n−2), U [n−2], . . . , V [k], U [k], . . . , V [0], U [0]).
 7. A graphic computation device comprising: a storage circuit for storing texture data which is image data to be pasted to unit shapes serving as basic units for expressing the form to be displayed on a display, each of the units shapes having associated apexes; a polygon rendering data generating means for generating polygon rendering data for the apexes of said unit shape, including data for three-dimensional coordinates (x, y, z), R (red), G (green), B (blue), and homogeneous coordinates (s, t) and homogeneous item q; an interpolation data generating means for interpolating the polygon rendering data for the apexes of said unit shape, and generating interpolation data for pixels positioned within said unit shape; a two-dimensional address generating means for generating a two-dimensional address (U, V) comprised of a U address represented by n bits of data (wherein n is an integer of 1 or greater) and a V address represented by m bits of data (wherein m is an integer of 1 or greater), based on results of dividing said homogeneous coordinates (s, t) contained in said interpolation data by said homogeneous item q; a one-dimensional address generating means for generating (n+m)-bit one-dimensional addresses by combining the n bits of data making up the U address and the m bits of data making up the V address in said two-dimensional addresses (U, V); and a data reading means for using said generated one-dimensional addresses to read texture data from said storage circuit, and perform pasting there of to said unit shapes.
 8. The device of claim 7, wherein in the event that said integer a and said integer m are equal; and wherein k is an integer expressed by (n−1)<k<0; and wherein said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]); and wherein said V address is represented by the n bits of (V [n−1], . . . , V [k], . . . , V [0]); said address generating means combines each of the bit data U [n−1], . . . , [k], . . . , U [0] of said U address with each of the bit data V [n−1], . . . , V [k], . . . , V [0] of said V address, thereby generating 2n bits of one-dimensional addresses (V [n−1], U [n−1], . . . , V [k], U [k], V [0], U [0]).
 9. The device of claim 7, wherein in the event that said integer n is (n−1); and wherein k is an integer expressed by (n−1)<k<0; and wherein said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]); and wherein said V address is represented by the (n−1) bits of (V [n−2], . . . , V [k], . . . , V[0]); said address generating means combines each of the bit data U [n−1], . . . , U [k], . . . , U [0] of said U address with each of the bit data V [n−2], . . . , V [k], . . . , V [0] of said V address, thereby generating (2n−1) bits of one-dimensional addresses (U [n−1], V [n−2], U [n−2], . . . , V [k], U [k], . . . , V [0], U [0]).
 10. A graphic computation device for pasting texture data to a three-dimensional model to be displayed on a display device, the three-dimensional model represented by a combination of a plurality of unit shapes, each of the units shapes having associated apexes, said graphic computation device comprising: a polygon rendering data generating means for generating polygon rendering data regarding the apexes of said unit shape, the polygon rendering data including data for three-dimensional coordinates (x, y, z), R (red), G (green), B (blue), and homogeneous coordinates (s, t) and homogeneous item q; a rendering device for performing rendering processing using said polygon rendering data; and a bus for connecting said polygon rendering data generating device and said rendering device; wherein said rendering device comprises: a storage circuit for storing texture data; an interpolation data generating means for interpolating said polygon rendering data of the apexes of said unit shape input via said bus, and generating interpolation data for pixels positioned within said unit shape; a two-dimensional address generating means for generating a two-dimensional address (U, V) comprised of a U address represented by n bits of data (wherein n is an integer of 1 or greater) and a V address represented by m bits of data (wherein m is an integer of 1 or greater), based on results of dividing said homogeneous coordinates (s, t) contained in said interpolation data by said homogeneous item q; a one-dimensional address generating means for generating (n+m)-bit one-dimensional addresses by combining the n bits of data making up the U address and the m bits of data making up the V address in said two-dimensional addresses (U, V); and a data reading means for using said generated one-dimensional addresses to read texture data from said storage circuit, and perform pasting thereof to said unit shapes.
 11. The device of claim 10, wherein in the event that said integer n and said integer m are equal; and wherein k is an integer expressed by (n−1)<k<0; and wherein said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]); and wherein said V address is represented by the n bits of (V [n−1], . . . , V [k], . . . , V [0]); said address generating means combines each of the bit data U (n−1], . . . , U [k], . . . , U [0] of said U address with each of the bit data V [n−1], . . . , V [k], . . . , V [0] of said V address, thereby generating 2n bits of one-dimensional addresses (V [n−1], U [n−1], . . . , V [k], U [k], . . . , V [0], U [0]).
 12. The device of claim 10, wherein in the event that said integer m is (n−1); and wherein k is an integer expressed by (n−1)<k<0; and wherein said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]); and wherein said V address is represented by the (n−1) bits of (V [n−2], . . . , V [k], . . . , [0]); said address generating means combines each of the bit data U [n−1], . . . , U [k], . . . , U [0] of said U address with each of the bit data V [n−2], . . . , V [k], . . . , V [0] of said V address, thereby generating (2n−1) bits of one-dimensional addresses (U [n−1], V [n−2], U [n−2], . . . , V[k], U [k], . . . , V [0], U [0]).
 13. A method of accessing two-dimensional image data indicating color data of a plurality of pixels arrayed in matrix fashion from a storage circuit using a two-dimensional address (U, V) corresponding to the two-dimensional positioning of said plurality of pixels, the U address represented by n bits of data having a bit value (wherein n is an integer of 1 or greater) and the V address represented by m bits of data having a bit value (wherein m is an integer of 1 or greater), each of the U address and the V address having a decimal vale corresponding to its bit value, said method comprising: combining the n bits of data making up said U address and the m bits of data making up said V address to generate an (a+m)-bit one-dimensional address having a corresponding decimal value; and accessing ad storage circuit using said generated one-dimensional address; wherein the image data is stored in the storage circuit in a plurality of blocks forming a U, V matrix, where one axis of the matrix represents the decimal value of the n bits of data making up the U address, the other axis of the matrix represents the decimal value of the m bits of data making up the V address and each of the blocks correspond to the decimal value of one of a plurality of (n+m)-bit one-dimensional addresses.
 14. The method of claim 13, wherein in the event that said integer n and said integer m are equal; and wherein k is an integer expressed by (n−1)<k<0; and wherein said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]); and wherein said V address is represented by the n bits of (V [n−1], . . . , V [k], . . . , V [0]); each of the bit data U [n−1], . . . , U [k], . . . , U [0] of said U address arm combined with each of the bit data V [n−1], . . . , V [k], . . . , V [0] of said V address, thereby generating 2n bits of on-dimensional addresses (V [n−1], U [n−1], . . . , V [k], U [k], . . . , V [0], U [0]).
 15. The method of claim 13, wherein in the event that said integer m is (n−1); and wherein k is an integer expressed by (n−1)<k<0; and wherein said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]); and wherein said V address is represented by the (n−1) bits of (V [n−2], . . . , V [k], . . . , V [0]); each of the bit data U [n−1], . . . , U [k], . . . , U [0] of said U address are combined with each of to the bit data V [n−2], . . . , V [k], . . . , V [0] of said V address, thereby generating (2n−1) bits of one-dimensional addresses (U [n−1], V [n−2], U [n−2], . . . , V [k], U [k], . . . , V [0], U [0]).
 16. A method of pasting texture data to a three-dimensional model represented by a combination of a plurality of unit shapes, each unit shape including a plurality of pixels, each pixel having associated rendering data including a set of homogeneous coordinates (s, t) and a homogeneous item q said method comprising: storing a plurality of pieces of texture data in a storage circuit; generating two-dimensional addresses (U, V) comprised of a U address represented by n bits of data (wherein n is an integer of 1 or greater) and a V address represented by m bits of data (wherein m is at integer of 1 or greater), based on results of dividing said homogeneous coordinates (s, t) by said homogeneous item q; generating (n+m)-bit one-dimensional addresses by combining the n bits of data making up the U address and the m bits of data making up the V address in said two-dimensional addresses (U, V); and using said generated one-dimensional addresses to read texture data from said storage circuit, and perform pasting there of to said unit shapes.
 17. The method of claim 16, wherein in the event that said integer n and said integer m are equal; and wherein k is an integer expressed by (n−1)<k<0; and wherein said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]); and wherein said V address is represented by the n bits of (V [n−1], . . . , V [k], . . . , V [0]); each of the bit data U [n−1], . . . , U [k], . . . , U [0] of said U address are combined with each of the bit data V [n−1], . . . , V [k], . . . , V [0] of said V address, thereby generating 2n bits of one-dimensional addresses (V [n−1], U [n−1], . . . , V [k], U [k], . . . , V [0], U [0]).
 18. The method of claim 16, wherein in the event that said integer m is (n−1); and wherein k is an integer expressed by (n−1)<k <0; and wherein said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]); and wherein said V address is represented by the (n−1) bits of (V [n−2], . . . , V [k], . . . , V [0]); each of the bit data U [n−1], . . . , U [k], . . . , U [0] of said U address are combined with each of the bit data V [n−2], . . . , V [k], . . . , V [0] of said V address, thereby generating (2n−1) bits of one-dimensional addresses (U [n−1], V [n−2], U [n−2], . . . , V [k], U [k], . . . , V [0], U [0]).
 19. A storage circuit control device for accessing two-dimensional image data indicating color data of a plurality of pixels arrayed in matrix fashion from a storage unit using a two-dimensional address (U, V) corresponding to the two-dimensional positioning of said plurality of pixels, the U address represented by n bits of data (wherein n is an integer of 1 or greater) and the V address represented by m bits of data (wherein m is an integer of 1 or greater), said storage circuit control device comprising: an address generating means for combining the n bits of data making up a U address and the at bits of data making up a V address to generate an (n+m)-bit one-dimensional address; and data accessing means for a sing said storage circuit using said generated one-dimensional address; wherein when said integer n and said integer m are equal, k is an integer expressed by (n−1)<k<0, said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]), and said V address is represented by the n bits of (V [n−1], . . . , V [k], . . . , V [0]), said address generating means combines each of the bit data U [n−1], . . . , U [k], . . . , U [0] of said U address with each of the bit data V [n−1], . . . , V [k], . . . , V [0] of said V address, thereby generating 2n bits of one-dimensional addresses (V [n−1], U [n−1], . . . , V[k], U [k], . . . , V [0], U[0]).
 20. A storage circuit control device for accessing two-dimensional image data indicating color data of a plurality of pixels arrayed in matrix fashion from a storage circuit using a two-dimensional address ([J V) corresponding to the two-dimensional positioning of said plurality of pixels. the U address represented by n bits of data (wherein n is an integer of 1 or greater) and the V address represented by m bits of data (wherein m is an integer of 1 or greater), said storage circuit control device comprising: an address generating means for combining the n bits of data making up a U address and the m bits of data making up a V address to generate an (n+m)-bit one-dimensional address; and data accessing means for accessing said storage circuit using said generated one-dimensional address; wherein when said integer m is (n−1), k is an integer expressed by (n−1)<k<0, said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]), and said V address is represented by the (n−1) bits of (V [n−2], . . . , V [k], . . . , V [0]), said address generating means combines each of the bit data U [n−1], . . . , U [k], . . . , U [0] of said U address with each of the bit data V [n−2], . . . , V [k], . . . , V [0]) of said V address, thereby generating (2n−1) bits of one-dimensional addresses (U [n−1], V [n−2], U (n−2], . . . , V [0], U [0], . . . , V [0], U [0]).
 21. A method of accessing two-dimensional image data indicating color data of a plurality of pixels arrayed in matrix fashion from a storage unit, using a two-dimensional address (U, V) corresponding to the two-dimensional positioning of said plurality of pixels, the U address represented by n bits of data (wherein n is an integer of 1 or greater) and the V address represented by m bits of data (wherein m is an integer of 1 or greater), said method comprising: combining then bits of data making up said U address and the m bits of data making up said V address to generate an (n+m)-bit one-dimensional address; and accessing said storage circuit using said generated one-dimensional address; wherein when said integer n and said integer in are equal, k is an integer expressed by (n−1)<k<0, said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]), and said V address is represented by the n bits of (V [n−1], . . . , V [k], . . . , V [0]), each of the bit data U [n−1], . . . , U [k], . . . , U [0] of said U address are combined with each of the bit data V [n−1], . . . , V [k], . . . , V [0] of said V address, thereby generating 2n bits of one-dimensional addresses (V [n−1], U [n−1], . . . , V [k], U [k], . . . , V [0], U [0]).
 22. A method of accessing two-dimensional image data indicating color data of a plurality of pixels arrayed in matrix fashion from a storage unit, using a two-dimensional address (U, V) corresponding to the two-dimensional positioning of said plurality of pixels, the U address represented by n bits of data (wherein n is an integer of 1 or greater) and the V address represented by m bits of data (wherein m is an integer of 1 or greater), said method comprising: combining the n bits of data making up said U address and the in bits of data making up said V address to generate an (n+m)-bit one-dimensional address; and accessing said storage circuit using said generated one-dimensional address; wherein when said integer m is (n−1), k is an integer expressed by (n−1)<k<0, said U address is represented by the n bits of (U [n−1], . . . , U [k], . . . , U [0]), and wherein said V address is represented by the (n−1) bits of (V [n−2], . . . , V [k], . . . , V [0]), each of the bit data U [n−1], U [k], . . . , U [0] of said U address are combined with each of the bit data V [n−2], . . . , V [k], . . . , V [0] of said V address, thereby generating (2n−1) bits of one-dimensional addresses (U [n−1], V [n−2], U [n−2], . . . , V [k], U [k], . . . , V[0], U [0]). 